More Evaluation of Decision Procedures for Modal Logics
نویسندگان
چکیده
This paper follows on previous papers which presented and evaluated various decision procedures for modal logics. It connrms previous experimental results in showing that SAT based decision procedures, i.e., the procedures built on top of decision procedures for propositional satissability, are more ef-cient than tableau based decision procedures. It also connrms previous evidence of an easy-hard-easy pattern in the satissabil-ity curve for modal K. Finally, it provides further experimental results, suggesting that SAT based decision procedures are also more eecient than the decision procedures based on Ohlbach's translation method. Our results contradict some of the results presented in previous papers.
منابع مشابه
Sat vs. Translation Based Decision Procedures for Modal Logics: a Comparative Evaluation Istituto per La Ricerca Scientifica E Tecnologica Sat vs. Translation Based Decision Procedures for Modal Logics: a Comparative Evaluation
limited distribution notice This report has been submitted for publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of ITC prior to publication should be limited to peer communications and sp...
متن کاملIncremental Decision Procedures for Modal Logic with Nominals and Eventualities
This thesis contributes to the study of incremental decision procedures for modal logics with nominals and eventualities. Eventualities are constructs that allow to reason about the reflexive-transitive closure of relations. Eventualities are an essential feature of temporal logics and propositional dynamic logic (PDL). Nominals extend modal logics with the possibility to reason about state equ...
متن کاملGenerating Hard Modal Problems for Modal Decision Procedures
Random generation of modal formulae is a viable method for generating problems for benchmarking modal decision procedures. However, previous work in this area has used a flawed generator that has resulted in questionable results. Fixing the generator changes the characteristics of the generated problems. The fixed generator can be used to generate hard problems that have more interesting modal ...
متن کاملA New Space Bound for the Modal Logics
We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto known for the considered logics. In particular space requirements for our logics are reduced from the previously established bound O(n. logn) to O(n. logn).
متن کاملA General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments
This paper presents a general method for proving termination of tableaux-based procedures for modal-type logics and related firstorder fragments. The method is based on connections between filtration arguments and a general blocking technique. The method provides a general framework for developing tableau-based decision procedures for a large class of logics. In particular, the method can be ap...
متن کامل